Linear Polychromatic Colorings of Hypercube Faces
نویسندگان
چکیده
منابع مشابه
Linear Polychromatic Colorings of Hypercube Faces
A coloring of the `-dimensional faces of Qn is called d-polychromatic if every embedded Qd has every color on at least one face. Denote by p `(d) the maximum number of colors such that any Qn can be colored in this way. We provide a new lower bound on p`(d) for ` > 1.
متن کاملPolychromatic Colorings on the Hypercube
Given a subgraph G of the hypercube Qn, a coloring of the edges of Qn such that every embedding of G contains an edge of every color is called a G-polychromatic coloring. The maximum number of colors with which it is possible to G-polychromatically color the edges of any hypercube is called the polychromatic number of G. To determine polychromatic numbers, it is only necessary to consider a str...
متن کاملPolychromatic Colorings of Subcubes of the Hypercube
Alon, Krech, and Szabó [SIAM J. Discrete Math., 21 (2007), pp. 66–72] called an edge-coloring of a hypercube with p colors such that every subcube of dimension d contains every color a d-polychromatic p-coloring. Denote by pd the maximum number of colors with which it is possible to d-polychromatically color any hypercube. We find the exact value of pd for all values of d.
متن کاملPolychromatic colorings of bounded degree plane graphs
A polychromatic k-coloring of a plane graph G is an assignment of k colors to the vertices of G such that every face of G has all k colors on its boundary. For a given plane graph G, we seek the maximum number k such that G admits a polychromatic k-coloring. We call a k-coloring in the classical sense (i.e., no monochromatic edges) that is also a polychromatic k-coloring a strong polychromatic ...
متن کاملPolychromatic colorings of arbitrary rectangular partitions
A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex colorings using four colors of general partitions where every subrectangle is required to have all four colors appear on its boundary. It is shown that there exist general partitions that do not admit such a coloring. This answers a question of Di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2018
ISSN: 1077-8926
DOI: 10.37236/6455